Bichromatic 2-Center of Pairs of Points

نویسندگان

  • Esther M. Arkin
  • José Miguel Díaz-Báñez
  • Ferran Hurtado
  • Piyush Kumar
  • Joseph S. B. Mitchell
  • Belén Palop
  • Pablo Pérez-Lantero
  • Maria Saumell
  • Rodrigo I. Silveira
چکیده

We study a class of geometric optimization problems closely related to the 2-center problem: Given a set S of n pairs of points, assign to each point a color (“red” or “blue”) so that each pair’s points are assigned different colors and a function of the radii of the minimum enclosing balls of the red points and the blue points, respectively, is optimized. In particular, we consider the problems of minimizing the maximum and minimizing the sum of the two radii. For each case, minmax and minsum, we consider distances measured in the L2 and in the L∞ metrics. Our problems are motivated by a facility location problem in transportation system design, in which we are given origin/destination pairs of points for desired travel, and our goal is to locate an optimal road/flight segment in order to minimize the travel to/from the endpoints of the segment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions

We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in amortized time O(n1/2 log n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n) per update. Our algorithm uses a novel construction, the ordered nearest neighbor path of a set of points. Our results generalize to higher d...

متن کامل

Point-Set Embeddability of 2-Colored Trees

In this paper we study bichromatic point-set embeddings of 2-colored trees on 2-colored point sets, i.e., point-set embeddings of trees (whose vertices are colored red and blue) on point sets (whose points are colored red and blue) such that each red (blue) vertex is mapped to a red (resp. blue) point. We prove that deciding whether a given 2-colored tree admits a bichromatic point-set embeddin...

متن کامل

On balanced 4-holes in bichromatic point sets

Let S = R∪B be a set of n points in general position in the plane. The elements of R and B will be called, respectively, the red and blue elements of S. A k-hole of S is a simple polygon with k vertices, all in S, and containing no element of S in its interior. A 4-hole of S is balanced if it has two blue and two red vertices. In this paper, we characterize the set of bicolored points S = R∪B t...

متن کامل

Bichromatic Quadrangulations with Steiner Points

Abstract. Let P be a k colored point set in general position, k ≥ 2. A family of quadrilaterals with disjoint interiors Q1, . . . ,Qm is called a quadrangulation of P if V (Q1)∪ . . .∪V (Qm) = P , the edges of all Qi join points with different colors, and Q1 ∪ . . .∪Qm = Conv(P ). In general it is easy to see that not all k-colored point sets admit a quadrangulation; when they do, we call them ...

متن کامل

Maximum Plane Trees in Multipartite Geometric Graphs

A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-line segments between the points. A plane spanning tree in a geometric graph is a spanning tree that is non-crossing. Let R and B be two disjoint sets of points in the plane where the points of R are colored red and the points of B are colored blue, and let n = |R ∪ B|. A bichromatic plane spanning ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Geom.

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2012